Automata theory allows practice with formal definitions of computation as it introduces concepts relevant to other nontheoretical areas of computer science 自動控制理論允許執(zhí)行正式的計算定義,因為它引用了相關的計算機科學的其他非理論方面的概念。
Existing complexity proofs on the circularity problem of ags are based on automata theory , such as writing pushdown acceptor and alternating turing machines 目前對屬性文法循環(huán)性問題復雜度的證明,多基于自動機理論,如寫入推出接受器、交替涂林機等。
This paper presents some cellular automata models for traffic flow simulation . firstly , the celluar automata theory was introduced , cellular autoata models quantize complex behavior into simple individual components 本文首先介紹了元胞自動機理論的理論,元胞自動機模型把復雜系統(tǒng)量化為簡單的個體。
Security analyses of a variant of a new block cipher system ( called cac ) based on cellular automata theory are given using two cryptanalytic approaches . the results show that this variant of cac is very insecure under chosen - plaintext attacks 利用兩種方法對一個基于細胞自動機的分組密碼系統(tǒng)cac的變形進行了分析,結果表明: cac的這種變形在選擇明文攻擊下是極不安全的。
In theoretical computer science, automata theory is the study of mathematical objects called abstract machines or automata and the computational problems that can be solved using them. Automata comes from the Greek word α?τ?ματα meaning "self-acting".